Blind Source Separation with Conjugate Gradient Algorithm and Kurtosis Maximization Criterion
نویسندگان
چکیده
Blind source separation (BSS) is a technique for estimating individual source components from their mixtures at multiple sensors. It is called blind because any additional other information will not be used besides the mixtures. Recently, blind source separation has received attention because of its potential applications in signal processing such as in speech recognition systems, telecommunications and medical signal processing. Blind source separation of super and sub-Gaussian Signal is proposed utilizing conjugate gradient algorithm and kurtosis maximization criteria. In our previous paper, ABC algorithm was utilized to blind source separation and here, we improve the technique with changes in fitness function and scout bee phase. Fitness function is improved with the use of kurtosis maximization criterion and scout bee phase is improved with use of conjugate gradient algorithm. The evaluation metrics used for performance evaluation are fitness function values and distance values. Comparative analysis is also carried out by comparing our proposed technique to other prominent techniques. The technique achieved average distance of 38.39, average fitness value of 6.94, average Gaussian distance of 58.60 and average Gaussian fitness as 5.02. The technique attained lowest average distance value among all techniques and good values for all other evaluation metrics which shows the effectiveness of the proposed technique.
منابع مشابه
Blind Signal Separation Using an Extended Infomax Algorithm
The Infomax algorithm is a popular method in blind source separation problem. In this article an extension of the Infomax algorithm is proposed that is able to separate mixed signals with any sub- or super-Gaussian distributions. This ability is the results of using two different nonlinear functions and new coefficients in the learning rule. In this paper we show how we can use the distribution...
متن کاملBlind Signal Separation Using an Extended Infomax Algorithm
The Infomax algorithm is a popular method in blind source separation problem. In this article an extension of the Infomax algorithm is proposed that is able to separate mixed signals with any sub- or super-Gaussian distributions. This ability is the results of using two different nonlinear functions and new coefficients in the learning rule. In this paper we show how we can use the distribution...
متن کاملSource Separation of Speech Signals using Kurtosis Maximization
James P. LeBlanc Phillip L. De Leòn [email protected] [email protected] Klipsch School of ECE New Mexico State University Las Cruces, NM USA Abstract We present a computationally efficient method of separating mixed speech signals using a recursive adaptive gradient descent technique. The cost function is designed to maximize the kurtosis of the output (separated) signals. The choice of kurtosis ...
متن کاملSCG - ICA algorithm for Blind Signal Separation
The gradient based algorithms are the most basic independent component analysis (ICA) algorithms, used in Blind signal separation (BSS). Because these algorithms adopt fixed step size, the choice of step size affects the performance and the convergence speed of the algorithm. In this paper, we propose a new algorithm SCG-ICA for blind signal separation. The new algorithm significantly improves ...
متن کاملTurbo Source Separation Algorithm and Blind System Identification for Instantaneous MIMO Systems
Ding and Nguyen proposed a kurtosis maximization algorithm and Chi and Chen proposed a fast kurtosis maximization algorithm (FKMA) for blind separation of an instantaneous mixture of colored non-Gaussian sources. Their algorithms only involve spatial processing, but their performance may significantly degrade for finite signal-to-noise ratio as kurtosis magnitudes of source signals are not suff...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016